package everydayGrade.t3;

import org.junit.jupiter.api.Test;

import java.util.Arrays;

/**
 * @Author: Siantar
 * @Date: 2023-08-10-15:35
 * @Description: 1.0
 */
public class T1289 {
    public int minFallingPathSum(int[][] grid) {
        int n = grid.length;
        int min1 = 0;
        int min2 = 0;
        int min1Index = 0;
        int min2Index = 0;
        for (int i = 0; i < n; i++) {

        }
        return 0;

    }

    @Test
    public void test() {


    }

}
